Divisors of Bernoulli Sums

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Divisors of Bernoulli sums

Let B n = b 1 +. .. + b n , n ≥ 1 where b 1 , b 2 ,. .. are independent Bernoulli random variables. In relation with the divisor problem, we evaluate the almost sure asymptotic order of the sums N n=1 d θ,D (B n), where d θ,D (B n) = #{d ∈ D, d ≤ n θ : d|B n } and D is a sequence of positive integers.

متن کامل

Palindromic Sums of Proper Divisors

Fix an integer g 2. A natural number n is called a palindrome in base g if its base g expansion reads the same forwards and backwards. Let s(n) = P d|n, d<n d be the sum-of-proper-divisors function. We show that for almost all (that is, asymptotically 100% of) natural numbers n, s(n) is not a palindrome in base g. We also show how to reach the same conclusion for several other commonly occurrin...

متن کامل

Sums of Products of Bernoulli Numbers, Including Poly-Bernoulli Numbers

We investigate sums of products of Bernoulli numbers including poly-Bernoulli numbers. A relation among these sums and explicit expressions of sums of two and three products are given. As a corollary, we obtain fractional parts of sums of two and three products for negative indices.

متن کامل

On Divisors of Sums of Integers, Iii

1. Let P{ή) and p(n) denote the greatest and smallest prime factor of n, respectively. Recently in several papers, Balog, Erdόs, Maier, Sarkozy, and Stewart have studied problems of the following type: if A\,...,Ak are "dense" sets of positive integers, then what can be said about the arithmetical properties of the sums a\ H h % with a,\ G A\,...,ak G Akl In particular, Balog and Sarkόzy proved...

متن کامل

Sums of Divisors, Perfect Numbers and Factoring

Let N be a positive integer, and let denote the sum of the divisors of N = 1+2+3+6 = 12). We show computing is equivalent to factoring N in the following sense: there is a random polynomial time algorithm that, given N),produces the prime factorization of N, and N) can be computed in polynomial time given the factorization of N. We show that the same result holds for the sum of the kth powers o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Results in Mathematics

سال: 2009

ISSN: 1422-6383,1420-9012

DOI: 10.1007/s00025-008-0299-z